Polynomial function intervals for floating-point software verification
نویسندگان
چکیده
منابع مشابه
Polynomial Function Enclosures and Floating Point Software Verification
Proving partial correctness of floating point programs is a hard verification problem. This is in part because error analysis of finite precision computation is difficult and in part due to the high complexity of the generated verification conditions. Typical verification conditions that arise in this context are predicates with real inequalities as atoms and therefore numerical constraint solv...
متن کاملFloating-Point Verification
This paper overviews the application of formal verification techniques to hardware in general, and to floating-point hardware in particular. A specific challenge is to connect the usual mathematical view of continuous arithmetic operations with the discrete world, in a credible and verifiable way.
متن کاملFloating Point Verification in HOL Light: The Exponential Function
Since they often embody compact but mathematically sophisticated algorithms , operations for computing the common transcendental functions in oating point arithmetic seem good targets for formal veriication using a mechanical theorem prover. We discuss some of the general issues that arise in veriications of this class, and then present a machine-checked veriication of an algorithm for computin...
متن کاملVerification of floating point programs
This copy of the thesis has been supplied on condition that anyone who consults it is understood to recognise that its copyright rests with its author and that no quotation from the thesis and no information derived from it may be published without proper acknowledgement. Thesis Summary In this thesis we present an approach to automated verification of floating point programs. Existing techniqu...
متن کاملVerification of Floating-Point Adders
The floating-point division bug in Intel's Pentium processor and the overflow flag erratum of the FIST instruction in Intel's Pentium Pro and Pentium II processor have demonstrated the importance and the difficulty of verifying floating-point arithmetic circuits. In this paper, we present a "black box" version of verification of FP adders. In our approach, FP adders are verified by an extended ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics and Artificial Intelligence
سال: 2014
ISSN: 1012-2443,1573-7470
DOI: 10.1007/s10472-014-9409-7